Optimization of Operation Sequences using Constraint Programming
نویسندگان
چکیده
منابع مشابه
Optimization of operation sequences using constraint programming
In this paper, we connect the dots: design and optimization of production systems. A possible link between these two areas is a previously presented modeling language, sequence planner language (SPL). It has been demonstrated how relevant information can be extracted from production systems modeling applications, and converted into SPL. We show how the SPL model can be converted into a constrai...
متن کاملautomatic verification of authentication protocols using genetic programming
implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...
15 صفحه اولConstraint Programming Based Biomarker Optimization
Efficient and intuitive characterization of biological big data is becoming a major challenge for modern bio-OMIC based scientists. Interactive visualization and exploration of big data is proven to be one of the successful solutions. Most of the existing feature selection algorithms do not allow the interactive inputs from users in the optimizing process of feature selection. This study invest...
متن کاملLogic, Optimization, and Constraint Programming
Because of their complementary strengths, optimization and constraint programming can be profitably merged. Their integration has been the subject of increasing commercial and research activity. This paper summarizes and contrasts the characteristics of the two fields; in particular, how they use logical inference in different ways, and how these ways can be combined. It sketches the intellectu...
متن کاملSolving Distributed Constraint Optimization Problems Using Logic Programming
This paper explores the use of answer set programming (ASP) in solving distributed constraint optimization problems (DCOPs). It makes the following contributions: (i) It shows how one can formulate DCOPs as logic programs; (ii) It introduces ASP-DPOP, the first DCOP algorithm that is based on logic programming; (iii) It experimentally shows that ASP-DPOP can be up to two orders of magnitude fas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2012
ISSN: 1474-6670
DOI: 10.3182/20120523-3-ro-2023.00249